翻訳と辞書 Words near each other ・ Expectation fulfilment theory of dreaming ・ Expectation of privacy ・ Expectation of the Blessed Virgin Mary ・ Expectation propagation ・ Expectation states theory ・ Expectation value (quantum mechanics) ・ Expectations (Dance Exponents album) ・ Expectations (Keith Jarrett album) ・ Expectations from the Muslim Woman ・ Expectations hypothesis ・ Expectation–maximization algorithm ・ Expectative ・ Expected ・ Expected commercial value ・ Expected Family Contribution ・ Expected linear time MST algorithm ・ Expected loss ・ Expected marginal seat revenue ・ Expected progeny difference ・ Expected return ・ Expected satiety ・ Expected shortfall ・ Expected transmission count ・ Expected utility hypothesis ・ Expected value ・ Expected value (disambiguation) ・ Expected value of including uncertainty ・ Expected value of perfect information ・ Expected value of sample information ・ Expectiminimax tree Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Expected linear time MST algorithm ： ウィキペディア英語版 Expected linear time MST algorithm A randomized algorithm for computing the minimum spanning forest of a weighted graph with no isolated vertices. It was developed by David Karger, Philip Klein, and Robert Tarjan. The algorithm relies on techniques from Borůvka's algorithm along with an algorithm for verifying a minimum spanning tree in linear time.〔 〕 It combines the design paradigms of divide and conquer algorithms, greedy algorithms, and randomized algorithms to achieve expected linear performance. Deterministic algorithms that find the minimum spanning tree include Prim's algorithm, Kruskal's algorithm, reverse-delete algorithm, and Borůvka's algorithm. ==Overview== The key insight to the algorithm is a random sampling step which partitions a graph into two subgraphs by randomly selecting edges to include in each subgraph. The algorithm recursively finds the minimum spanning forest of the first subproblem and uses the solution in conjunction with a linear time verification algorithm to discard edges in the graph that cannot be in the minimum spanning tree. A procedure taken from Borůvka's algorithm is also used to reduce the size of the graph at each recursion. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Expected linear time MST algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.